-
1 semantic theorem
-
2 theorem
- theorem of total probability
- acoustical reciprocity theorem
- Ampere's circuital theorem
- average theorem
- Bayes theorem
- Birkhoff-von Neumann theorem
- Bloch theorem
- Brouwer fixed-point theorem
- Cayley theorem - Chinese residue theorem
- compensation theorem
- completeness theorem
- constant-flux-linkage theorem
- Coopmans theorem
- CPT-theorem
- Cramer theorem
- current sheet theorem
- Dilworth theorem
- divergence theorem
- Floquet theorem
- Foster's reactance theorem
- Fourier theorem
- fuzzy theorem
- fuzzy approximation theorem
- Gauss theorem
- Gauss-Markov theorem
- Gödel's theorem
- Gödel's incompleteness theorem
- Hecht-Nielsen theorem
- hierarchy theorem
- Kolmogorov theorem
- Kolmogorov-Arnold theorem
- limit theorem
- logic theorem
- Lüders-Pauli theorem
- Manley-Rowe theorem
- matching theorem
- McCulloh-Pitts theorem
- Mermin-Wagner theorem
- Nyquist's theorem
- Poincare-Birkhoff theorem
- Poynting's theorem
- reciprocity theorem
- Radon theorem
- Routh-Hurwitz theorem
- sampling theorem
- selection theorem
- semantic theorem
- Shannon theorem
- Slutsky's theorem
- Stokes theorem
- Stone theorem
- superposition theorem
- syntactical theorem
- Takens theorem
- Thevenin's theorem
- unicity theorem
- Weierstrass theorem
- Wiener-Khintchin theorem
- Zorn theorem -
3 system
1) система; комплекс2) совокупность•- absolutely consistent system - absolutely direct indecomposable system - absolutely free system - absolutely irreducible system - absolutely isolated system - allowable coordinate system - almost linear system - ample linear system - artificial feel system - automatic block system - automatic deicing system - binary relational system - binary-coded decimal system - block tooling system - Cartesian coordinate system - completely controllable system - completely ergodic system - completely hyperbolic system - completely identifiable system - completely integrable system - completely irreducible system - completely regular system - completely stable system - completely stratified system - complex number system - conical coordinate system - derivational formal system - differential equation system - differential selsyn system - digital counting system - digital transmission system - elliptic coordinate system - elliptic cylindrical coordinate system - externally inconsistent system - finite state system - finitely axiomatizable system - finitely presented system - fully characteristic quotient system - fundamental system of solutions - hydraulic lift system - integrated switching system - isomorphically embedded system - kernel normal system - linearly dependent system - linearly independent system - live hydraulic system - locking protection system - meteor-burst communication system - modular programming system - parabolic cylindrical coordinate system - permanent four-wheel drive system - pure independent system - radio telephone system - reactor protection system - real number system - receiver-amplifier crioelectric system - remote-cylinder hydraulic system - semantically consistent system - simply consistent system - simply incomplete system - simply ordered system - spherical coordinate system - strongly multiplicative system - structurally stable system - sufficiently general coordinate system - system of frequency curves - system of rational numbers - time multiplex system - time-division multiplex system - uniformly complete system - univalent system of notation - universal system of notation - weakly closed system - weighted number system -
4 equation
1. n книжн. выравнивание, уравнивание; уравновешиваниеerror equation — уравнивание ошибок; уравнивание погрешностей
2. n книжн. уравновешенность, правильное соотношение; согласованность3. n книжн. приравниваниеpersonal equation — поправка на личные особенности, на характер
4. n книжн. хим. уравнение, формула реакцииСинонимический ряд:symbolic representation (noun) chemical formula; empirical formula; formula; graphic formula; logarithm; ratio; recipe; symbolic representation; theorem
См. также в других словарях:
Semantic gap — The semantic gap characterizes the difference between two descriptions of an object by different linguistic representations, for instance languages or symbols. In computer science, the concept is relevant whenever ordinary human activities,… … Wikipedia
Semantic Information Retrieval — Principaux projets et réalisations en intelligence artificielle Cette liste indique les principaux projets et réalisations marquants dans le domaine de l’intelligence artificielle. La quasi totalité de ces travaux ont été accomplis aux États Unis … Wikipédia en Français
Semantic theory of truth — A semantic theory of truth is a theory of truth in the philosophy of language which holds that truth is a property of sentences.[1] Contents 1 Origin 2 Tarski s Theory 3 See also … Wikipedia
Semantic Web Rule Language — SWRL (Semantic Web Rule Language) is a proposal for a Semantic Web rules language, combining sublanguages of the OWL Web Ontology Language (OWL DL and Lite) with those of the Rule Markup Language (Unary/Binary Datalog).The specification was… … Wikipedia
Tarski's undefinability theorem — Tarski s undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that arithmetical truth… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Compactness theorem — In mathematical logic, the compactness theorem states that a set of first order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful method for… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Tarski's theorem — Several results obtained by the noted logician Alfred Tarski are commonly referred to as Tarski s theorem:*Tarski s theorem on real closed fields established the decidability of the first order theory of real numbers. *The Knaster Tarski theorem… … Wikipedia
SNARK theorem prover — SNARK, SRI s New Automated Reasoning Kit, is a theorem prover for multi sorted first order logic intended for applications in artificial intelligence and software engineering. SNARK s principal inference mechanisms are resolution and… … Wikipedia
Gödel's theorem(s) — Gödel s first incompleteness theorem states that for any consistent logical system S able to express arithmetic there must exist sentences that are true in the standard interpretation of S, but not provable. Moreover, if S is omega consistent… … Philosophy dictionary